Working out an example with CEGAR
نویسنده
چکیده
In this article we will briefly introduce the abstraction refinement approach (CEGAR) [1] [2], developed by Clarke et. al.. CEGAR is an automatic iterative abstraction refinement technique for symbolic model checking. We will work with an example, and will demonstrate how the different steps of CEGAR algorithm work to generate an abstract model, which is free from the spurious counterexample encountered.
منابع مشابه
Information Flow Analysis via Path Condition Refinement
We present a new approach to information flow control (IFC), which exploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existing IFC analysis in which illegal flows are characterized using program dependence graphs (PDG) and path conditions (as described in [12]). Although path conditions provide an already precise abstraction that c...
متن کاملHybridization Based CEGAR for Hybrid Automata with Affine Dynamics
We consider the problem of safety verification for hybrid systems, whose continuous dynamics in each mode is affine, Ẋ = AX + b, and invariants and guards are specified using rectangular constraints. We present a counter-example guided abstraction refinement framework (CEGAR), which abstract these hybrid automata into simpler ones with rectangular inclusion dynamics, ẋ ∈ I, where x is a variabl...
متن کاملHybrid Automata-Based CEGAR for Rectangular Hybrid Systems
In this paper we present a framework for carrying out counterexample guided abstraction-refinement (CEGAR) for systems modelled as rectangular hybrid automata. The main difference, between our approach and previous proposals for CEGAR for hybrid automata, is that we consider the abstractions to be hybrid automata as well. We show that the CEGAR scheme is semi-complete for the class of rectangul...
متن کاملHybrid Automata-based CEGAR for Hybrid Systems
In this paper we present a framework for carrying out counterexample guided abstraction-refinement (CEGAR) for systems modelled as hybrid automata. The main difference, between our approach and previous proposals for CEGAR for hybrid automata, is that we consider the abstractions to be hybrid automata as well. We present a counterexample guided abstraction refinement method for systems modelled...
متن کاملA Decade of Software
P ́, preds ∪ refine(pr f)) The ability to refine the (Boolean program) abstraction to rule out a spurious counterexample is known as the progress property of the CEGAR process. Despite the progress property, the CEGAR process offers no guarantee of terminating since the program P ́ may have an intractably large or infinite number of states; it can refine the Boolean program forever without discov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016